Surrogate dual problems and surrogate lagrangians
نویسندگان
چکیده
منابع مشابه
Surrogate Assisted Feature Computation for Continuous Problems
A possible approach to Algorithm Selection and Configuration for continuous black box optimization problems relies on problem features, computed from a set of evaluated sample points. However, the computation of these features requires a rather large number of such samples, unlikely to be practical for expensive real-world problems. On the other hand, surrogate models have been proposed to tack...
متن کاملINTRODUCTION AND DEVELOPMENT OF SURROGATE MANAGEMENT FRAMEWORK FOR SOLVING OPTIMIZATION PROBLEMS
In this paper, we have outlined the surrogate management framework for optimization of expensive functions. An initial simple iterative method which we call the “Strawman” method illustrates how surrogates can be incorporated into optimization to stand in for the most expensive function. These ideas are made rigorous by incorporating them into the framework of pattern search methods. The SMF al...
متن کاملLagrangean/surrogate relaxation for generalized assignment problems
This work presents Lagrangean/surrogate relaxation to the problem of maximum pro®t assignment of n tasks to m agents (n > m), such that each task is assigned to only one agent subject to capacity constraints on the agents. The Lagrangean/surrogate relaxation combines usual Lagrangean and surrogate relaxations relaxing ®rst a set of constraints in the surrogate way. Then, the Lagrangean relaxati...
متن کاملAPPLICATION OF KRIGING METHOD IN SURROGATE MANAGEMENT FRAMEWORK FOR OPTIMIZATION PROBLEMS
In this paper, Kriging has been chosen as the method for surrogate construction. The basic idea behind Kriging is to use a weighted linear combination of known function values to predict a function value at a place where it is not known. Kriging attempts to determine the best combination of weights in order to minimize the error in the estimated function value. Because the actual function value...
متن کاملOn the relation between concavity cuts and the surrogate dual for convex maximization problems
In this note we establish a relation between two bounds for convex maximization problems, the one based on a concavity cut, and the surrogate dual bound. Both bounds have been known in the literature for a few decades but, to the authors’ knowledge, the relation between them has not been previously observed in the literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1984
ISSN: 0022-247X
DOI: 10.1016/0022-247x(84)90277-4